Routing into Two Parallel Links: Game-Theoretic Distributed Algorithms
نویسندگان
چکیده
Eitan Altman, Tamer Ba3ar, Tania Jiménez and Nahum Shimkin y INRIA B.P. 93, 06902 Sophia Antipolis Cedex, France. Tel: (33) 4 92 38 77 86; Fax: (33) 4 92 38 77 65; Email: [email protected], z Coordinated Science Laboratory, University of Illinois, 1308 West Main Street, Urbana, IL 61801-2307, USA. Tel: (1) 217 333-3607; Fax: (1) 217 244-1653; Email: [email protected]. C.E.S.I.M.O., Universidad de los Andes, Mrida, Venezuela, and INRIA B.P. 93, 06902 Sophia Antipolis Cedex, France. Email: [email protected] Tel: (33) 4 92 38 79 74; Fax: (33) 4 92 38 77 65 Electrical Engineering Department, Technion, Haifa 32000, Israel. Tel: (+972) 4 829 4734; Fax: +972 4 906990; Email: [email protected].
منابع مشابه
Graph Matching-Based Distributed Clustering and Backbone Formation Algorithms for Sensor Networks
Clustering is a widely used technique to manage the essential operations such as routing and data aggregation in wireless sensor networks (WSNs). We propose two new graph-theoretic distributed clustering algorithms for WSNs that use a weighted matching method for selecting strong links. To the best of our knowledge, our algorithms are the first attempts that use graph matching for clustering. T...
متن کاملSensor-centric energy-constrained reliable query routing for wireless sensor networks
Standard wireless sensor network models emphasize energy efficiency and distributed decision-making by considering untethered and unattended sensors. To this we add two constraints—the possibility of sensor failure and the fact that each sensor must tradeoff its own resource consumption with overall network objectives. In this paper, we develop an analytical model of energy-constrained, reliabl...
متن کاملA Density-based Energy-efficient Game-theoretic Routing Algorithm for Wireless Sensor Networks
Study on energy-efficient routing algorithms is one of the critical problems of wireless sensor networks. In this paper, we propose a Density-based Energy-efficient Game-theoretic Routing Algorithm (DEGRA). As a clustering algorithm, DEGRA adopts game theory and make cluster head determination based on nodes’ density, residual energy and average energy consumption of its neighboring nodes. We a...
متن کاملA JOINT DUTY CYCLE SCHEDULING AND ENERGY AWARE ROUTING APPROACH BASED ON EVOLUTIONARY GAME FOR WIRELESS SENSOR NETWORKS
Network throughput and energy conservation are two conflicting important performance metrics for wireless sensor networks. Since these two objectives are in conflict with each other, it is difficult to achieve them simultaneously. In this paper, a joint duty cycle scheduling and energy aware routing approach is proposed based on evolutionary game theory which is called DREG. Making a trade-off ...
متن کاملA Decentralized Model for Virtual Path Capacity Allocation
We investigate the problem of Virtual Path (VP) capacity allocation in a decentralized way. Users (VP controllers), sharing common network resources, are assumed to control their VP capacities according to their performance measures. We formulate a model that differs from previous ones in two points: first, each user has its own performance objective that is simply assumed to be concave and smo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Parallel Distrib. Comput.
دوره 61 شماره
صفحات -
تاریخ انتشار 2001